Cryptanalysing the critical group: efficiently solving Biggs's discrete logarithm problem
نویسندگان
چکیده
منابع مشابه
Cryptanalysing the critical group: efficiently solving Biggs's discrete logarithm problem
Biggs has recently proposed the critical group of a certain class of finite graphs as a platform group for cryptosystems relying on the difficulty of the discrete log problem. The paper uses techniques from the theory of Picard groups on finite graphs to show that the discrete log problem can be efficiently solved in Biggs’s groups. Thus this class of groups is not suitable as a platform for di...
متن کاملThe discrete logarithm problem modulo one: cryptanalysing the Ariffin-Abu cryptosystem
The paper provides a cryptanalysis the AAβ-cryptosystem recently proposed by Ariffin and Abu. The scheme is in essence a key agreement scheme whose security is based on a discrete logarithm problem in the infinite (additive) group R/Z (the reals modulo 1). The paper breaks the AAβ-cryptosystem (in a passive adversary model) by showing that this discrete logarithm problem can be efficiently solv...
متن کاملSolving the Discrete Logarithm Problem for Packing Candidate Preferences
Ranked elections are used in many places across the world, and a number of end-to-end verifiable voting systems have been proposed to handle these elections recently. One example is the vVote system designed for the Victorian State Election, Australia. In this system, many voters will give a full ranking of up to 38 candidates. The easiest way to do this is to ask each voter to reorder cipherte...
متن کاملKangaroo Methods for Solving the Interval Discrete Logarithm Problem
The interval discrete logarithm problem is defined as follows: Given some g, h in a group G, and some N ∈ N such that gz = h for some z where 0 ≤ z < N , find z. At the moment, kangaroo methods are the best low memory algorithm to solve the interval discrete logarithm problem. The fastest non parallelised kangaroo methods to solve this problem are the three kangaroo method, and the four kangaro...
متن کاملAn Efficient Group Signature Based on the Discrete Logarithm Problem
Group signature schemes permit a group member signing on messages anonymously and unlinkably on behalf of a group. The anonymity can be revoked when arguments occurred. This paper proposes an efficient group signature scheme based on the discrete logarithm problem, which means no trapdoor functions are used in the settings of cryptographic parameters. Both the group public key and signature siz...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Mathematical Cryptology
سال: 2009
ISSN: 1862-2976,1862-2984
DOI: 10.1515/jmc.2009.010